An Overview of Non-Uniform Parameterized Complexity

نویسنده

  • Ronald de Haan
چکیده

We consider several non-uniform variants of parameterized complexity classes that have been considered in the literature. We do so in a homogenous notation, allowing a clear comparison of the various variants. Additionally, we consider some novel (non-uniform) parameterized complexity classes that come up in the framework of parameterized knowledge compilation. We provide some (inclusion and separation) results relating the different non-uniform classes to each other. Moreover, we illustrate how these non-uniform parameterized complexity classes are useful in the setting of parameterized knowledge compilation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on parameterized exponential time complexity

In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2p(n)) time if and only if it has an f(k)-uniform parameterized exponential time scheme (p is a polynomial). We then illustrate how our formulation can be used to show that special instances of parameterized NPhard problems are as difficult as the ...

متن کامل

Chaos/Complexity Theory and Education

Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...

متن کامل

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)

We study the complexity of a group of distance-constrained graph labeling problems when parameterized by the neighborhood diversity (nd), which is a natural graph parameter between vertex cover and clique width. Neighborhood diversity has been used to generalize and speed up FPT algorithms previously parameterized by vertex cover, as is also demonstrated by our paper. We show that the Uniform C...

متن کامل

Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems

There are different ways for an external agent to influence the outcome of an election. We concentrate on “control” by adding or deleting candidates of an election. Our main focus is to investigate the parameterized complexity of various control problems for different voting systems. To this end, we introduce natural digraph problems that may be of independent interest. They help in determining...

متن کامل

A note on the complexity of deterministic tree-walking transducers

The deterministic tree-walking transducer is one of a number of possible formalisms for defining mildly context-sensitive languages. It is well known that the non-uniform membership problem for languages that can be defined in this formalism is solvable in polynomial time. The uniform membership problem, where both the transducer and the word in question are considered part of the input, is les...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015